منابع مشابه
Generalized connected domination in graphs
As a generalization of connected domination in a graph G we consider domination by sets having at most k components. The order γ c (G) of such a smallest set we relate to γc(G), the order of a smallest connected dominating set. For a tree T we give bounds on γ c (T ) in terms of minimum valency and diameter. For trees the inequality γ c (T ) ≤ n− k − 1 is known to hold, we determine the class o...
متن کاملConnected domination of regular graphs
A dominating set D of a graph G is a subset of V (G) such that for every vertex v ∈ V (G), either v ∈ D or there exists a vertex u ∈ D that is adjacent to v in G. Dominating sets of small cardinality are of interest. A connected dominating set C of a graph G is a dominating set of G such that the subgraph induced by the vertices of C in G is connected. A weakly-connected dominating set W of a g...
متن کاملOn Domination in 2-Connected Cubic Graphs
In 1996, Reed proved that the domination number, γ(G), of every n-vertex graph G with minimum degree at least 3 is at most 3n/8 and conjectured that γ(H) ≤ dn/3e for every connected 3-regular (cubic) n-vertex graph H. In [1] this conjecture was disproved by presenting a connected cubic graph G on 60 vertices with γ(G) = 21 and a sequence {Gk} ∞ k=1 of connected cubic graphs with limk→∞ γ(Gk) |V...
متن کاملOuter-k-connected component domination in graphs
A subset S of the vertices of a graph G is an outer-connected dominating set, if S is a dominating set of G and G − S is connected. The outer-connected domination number of G, denoted by γ̃c(G), is the minimum cardinality of an OCDS of G. In this paper we generalize the outer-connected domination in graphs. Many of the known results and bounds of outer-connected domination number are immediate c...
متن کاملOn connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each vertex outside D has at least one neighbor in D. Approximations of minimum connected dominating sets are often used to represent a virtual routing backbone in wireless networks. This paper first proposes a constant-ratio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2019
ISSN: 1382-6905,1573-2886
DOI: 10.1007/s10878-019-00380-7